OVI-3: A NoSQL visual query system supporting efficient anti-joins

نویسندگان

چکیده

Abstract The aim of this work was to develop a technique speed up complex joins in an incremental visual query system. When designing visual, highly interactive interface for ad-hoc (read-only) queries, fast response times are paramount importance. While column-oriented DBMS reduces the inherent latency found relational DBMS, there is still question how index data, especially so as support joins. Equi-joins that involve many-to-many relationship example arise frequently and whose efficient processing essential processing. We present OVI-3, NoSQL system based on querying uses simple directory-based indexing scheme faster such has been piloted using real data from student database at Aalto University. results demonstrated certain presented outperforms SQL queries server, involving anti-joins (negation), where OVI-3 provided orders magnitude improvement.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Structural Joins: A Primitive for Efficient XML Query Pattern Matching

XML queries typically specify patterns of selection predicates on multiple elements that have some specified tree structured relationships. The primitive tree structured relationships are parent-child and ancestor-descendant, and finding all occurrences of these relationships in an XML database is a core operation for XML query processing. In this paper, we develop two families of structural jo...

متن کامل

Supporting Efficient Recursive Query Processing in DHTs

Although various approaches have been proposed to process complex queries, such as range queries, join queries, aggregate queries and etc., in Peer-to-Peer data management research, we find currently there are no efficient techniques to support linear recursive queries, which is also one indispensable types of queries and exhibits crucial importance in many scenarios. In this paper, we propose ...

متن کامل

An Efficient Approach to Vague Joins in the Vague Query System

This article presents problems arisen when processing complex vague joins in the Vague Query System (VQS) and introduces a new solution to efficiently solve these problems. Join operation is one of the most expensive ones in database management systems. In context of the VQS, vague joins are prohibitively expensive in terms of IO-cost and CPUcost because they must undergo intermediate processin...

متن کامل

Executing Joins Dynamically in Distributed Database System Query Optimizer

In order to join two sub queries involving data from multiple sites data has to be transmitted from one site to other. While transmitting the data within a network, the factors involved in distributed databases is communication cost and amount of data transmitted. To minimize these factors, join operation is used. There are two cases considered in which query processing using join and query pro...

متن کامل

1 QBD * : A Fully Visual Query System

The need of a friendly man-machine interaction is becoming crucial for a large variety of applications, in particular, those requiring frequent extraction of information from the database. Experience suggests that traditional query languages are not friendly enough for the casual user: she/he is requested to formulate queries in a textual language, without any iconic or spatial clues to help th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Intelligent Information Systems

سال: 2022

ISSN: ['1573-7675', '0925-9902']

DOI: https://doi.org/10.1007/s10844-022-00742-4